Existence of nash equilibria for constrained stochastic games
نویسندگان
چکیده
In this paper, we consider constrained noncooperativeN -person stochastic games with discounted cost criteria. The state space is assumed to be countable and the action sets are compact metric spaces. We present three main results. The first concerns the sensitivity or approximation of constrained games. The second shows the existence of Nash equilibria for constrained games with a finite state space (and compact actions space), and, finally, in the third one we extend that existence result to a class of constrained games which can be “approximated” by constrained games with finitely many states and compact action spaces. Our results are illustrated with two examples on queueing systems, which clearly show some important differences between constrained and unconstrained games.
منابع مشابه
Soft-constrained stochastic Nash games for weakly coupled large-scale systems
In this paper, we discuss infinite-horizon soft-constrained stochastic Nash games involving state-dependent noise in weakly coupled large-scale systems. First, we formulate linear quadratic differential games in which robustness is attained against model uncertainty. It is noteworthy that this is the first time conditions for the existence of robust equilibria have been derived based on the sol...
متن کاملExistence of Pareto Equilibria for Non-compact Constrained Multi-criteria Games
In this paper, an existence result of quasi-equilibrium problem is proved and used to establish the existence of weighted Nash equilibria for constrained multi-criteria games under a generalized quasiconvexity condition and a coercivity type condition on the payoff functions. As consequence, we prove the existence of Pareto equilibria for constrained multi-criteria games with non-compact strate...
متن کاملStationary Nash Equilibria for Average Stochastic Games with Finite State and Action Spaces
Abstract. We study the problem of the existence of stationary Nash equilibria in infinite n-person stochastic games with limiting average payoff criteria for the players. The state and action spaces in the games are assumed to be finite. We present some results for the existence of stationary Nash equilibria in a multichain average stochastic game with n players. Based on constructive proof of ...
متن کاملThe Complexity of Nash Equilibria in Limit-Average Games
We study the computational complexity of Nash equilibria in concurrent games with limit-average objectives. In particular, we prove that the existence of a Nash equilibrium in randomised strategies is undecidable, while the existence of a Nash equilibrium in pure strategies is decidable, even if we put a constraint on the payoff of the equilibrium. Our undecidability result holds even for a res...
متن کاملConstrained Pure Nash Equilibria in Polymatrix Games
We study the problem of checking for the existence of constrained pure Nash equilibria in a subclass of polymatrix games defined on weighted directed graphs. The payoff of a player is defined as the sum of nonnegative rational weights on incoming edges from players who picked the same strategy augmented by a fixed integer bonus for picking a given strategy. These games capture the idea of coord...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Meth. of OR
دوره 63 شماره
صفحات -
تاریخ انتشار 2006